#include"Sort.h"

void TestInsertSort()
{
	int a[10] = { 1,2,6,7,9,4,3,10,15,5 };
	InserSort(a, 10);
	PrintArray(a, 10);
}
void TestShellSort2()
{
	int a[10] = { 1,2,6,7,9,4,3,10,15,5 };
	ShellSort(a, 10);
	PrintArray(a, 10);
}
void TestSelectSort3()
{
	int a[10] = { 1,2,6,7,9,4,3,10,15,5 };
	SelectSort(a, 10);
	PrintArray(a, 10);
}
void TestBubbleSort4()
{
	int a[10] = { 1,2,6,7,9,4,3,10,15,5 };
	BubbleSort(a, 10);
	PrintArray(a, 10);
}

void TestQuickSort()
{
	int a[12] = { 1,0,-1,2,6,7,9,4,3,10,15,5 };
	QuickSort(a, 0, 11);
	PrintArray(a, 12);
}
void TestQuickSort2()
{
	int a[12] = { 1,0,-1,2,6,7,9,4,3,10,15,5 };
	QuickSortNonR(a, 0, 11);
	PrintArray(a, 12);
}

void TestHeapSort()
{
	int a[] = { 5,11,7,2,3,17};
	HeapSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestMergeSort()
{
	int a[] = {6,1,2,7,9,3,4,5,10};
	MergeSortNonR(a,sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}

void TestCountSort()
{
	int a[] = { 3,3,6,2,5,9,6,1,0,8,4,0 };
	 CountSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}

int main()
{
	//TestBubbleSort4();
	TestCountSort();
	return 0;
}